Generalized Urn Models of Evolutionary Processes
نویسنده
چکیده
Generalized Polya urn models can describe the dynamics of finite populations of interacting genotypes. Three basic questions these models can address are: Under what conditions does a population exhibit growth? On the event of growth, at what rate does the population increase? What is the long term behavior of the distribution of genotypes? To address these questions, we associate a mean limit ordinary differential equation (ODE) with the urn model. Previously, it has been shown that on the event of population growth, the limiting distribution of genotypes is a connected internally chain recurrent set for the mean limit ODE. To determine when growth and convergence occurs with positive probability, we prove two results. First, if the mean limit ODE has an “attainable” attractor at which growth is expected, then growth and convergence toward this attractor occurs with positive probability. Second, the population distribution almost surely does not converge to sets where growth is not expected, and almost surely does not converge to “non-degenerate” unstable equilibria or periodic orbits of the mean limit ODE. Applications to stochastic analogs of the replicator equations and fertility-selection equations of population genetics are given. Revised for the Annals of Applied Probability
منابع مشابه
P´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملContexts in quantum, classical and partition logic
IV. Automata and generalized urn logic 11 A. Partition logic 13 B. Generalized urn models 13 C. Automaton models 13 D. Proof of logical equivalence 14 1. Direct construction of automaton models from generalized urn models 14 2. Direct construction of generalized urn models from automaton models 14 3. Schemes using dispersion-free states 14 4. Example 1: The generalized urn logic L12 16 5. Examp...
متن کاملSome Exactly Solvable Models of Urn Process Theory
We establish a fundamental isomorphism between discrete-time balanced urn processes and certain ordinary differential systems, which are nonlinear, autonomous, and of a simple monomial form. As a consequence, all balanced urn processes with balls of two colours are proved to be analytically solvable in finite terms. The corresponding generating functions are expressed in terms of certain Abelia...
متن کاملGeneralized Pólya Urn for Time-Varying Pitman-Yor Processes
This article introduces a class of first-order stationary time-varying Pitman-Yor processes. Subsuming our construction of time-varying Dirichlet processes presented in (Caron et al., 2007), these models can be used for time-dynamic density estimation and clustering. Our intuitive and simple construction relies on a generalized Pólya urn scheme. Significantly, this construction yields marginal ...
متن کامل